Перевод: с английского на русский

с русского на английский

bounded degree

См. также в других словарях:

  • Degree of anonymity — In anonymity networks (e.g. Tor, Crowds, Mixmaster, Tarzan, etc.) it is important to be able to measure quantitatively the guarantee that is given to the system. The degree of anonymity d is a device that was proposed at the 2002 Privacy… …   Wikipedia

  • Bounded variation — In mathematical analysis, a function of bounded variation refers to a real valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense. For a continuous function of a… …   Wikipedia

  • Degree diameter problem — In graph theory, the degree diameter problem is the problem of finding the largest possible graph G (in terms of the size of its vertex set V) of diameter k such that the largest degree of any of the vertices in G is at most d. The size of G is… …   Wikipedia

  • Degree of a continuous mapping — This article is about the term degree as used in algebraic topology. For other uses, see degree (mathematics). A degree two map of a sphere onto itself. In topology, the degree is a numerical invariant that describes a continuous mapping between… …   Wikipedia

  • spherical degree —    a unit of relative surface area for spheres, equal to 1/720 the total surface area or pi·R2/180, where R is the radius of the sphere. Thinking in terms of the Earth s surface, this is the area of the region in one hemisphere (northern or… …   Dictionary of units of measurement

  • Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

  • Independent set (graph theory) — The nine blue vertices form a maximum independent set for the Generalized Petersen graph GP(12,4). In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices …   Wikipedia

  • Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and …   Wikipedia

  • Polynomial ring — In mathematics, especially in the field of abstract algebra, a polynomial ring is a ring formed from the set of polynomials in one or more variables with coefficients in another ring. Polynomial rings have influenced much of mathematics, from the …   Wikipedia

  • Cubic graph — Not to be confused with graphs of cubic functions. The Petersen graph is a Cubic graph …   Wikipedia

  • Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»